Fuzzy Substructure Discovery

نویسندگان

  • Lawrence B. Holder
  • Diane J. Cook
  • Horst Bunke
چکیده

This paper describes a method for discovering substructures in data using a fuzzy graph match. A previous implementation of the Subdue system discovers substructures based on the psychologically-motivated criteria of cognitive savings, compactness, connec-tivity and coverage. However, the instances in the data must exactly match the discovered substructures. We describe a new implementation of Subdue that employs a fuzzy graph match to discover substructures which occur often in the data, but not always in the same form. This fuzzy substructure discovery can be used to formulate fuzzy concepts, compress the data description, and discover interesting structures in data that are found either in their pure form or in a slightly con-voluted form. Examples from the domains of scene analysis and chemical compound analysis demonstrate the fuzzy discovery technique .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pharmacophore Discovery using the InductiveLogic Programming System

This paper is a case study of a machine aided knowledge discovery process within the general area of drug design. More speciically, the paper describes a sequence of experiments in which an Inductive Logic Programming(ILP) system is used for pharmacophore discovery. Within drug design, a pharmacophore is a description of the substructure of a ligand (a small molecule) which is responsible for m...

متن کامل

Mining Fragments with Fuzzy Chains in Molecular Databases

This paper discusses methods to discover frequent, discriminative connected subgraphs (fragments) in a database of molecular structures. We present an extension to a well-known algorithm that allows for the discovery of fragments that contain chains of atoms of varying length. This is particularly important for real-world applications (for example drug discovery or synthetic success prediction)...

متن کامل

Graph-Based Hierarchical Conceptual Clustering

Hierarchical conceptual clustering has proven to be a useful, although under-explored, data mining technique. A graph-based representation of structural information combined with a substructure discovery technique has been shown to be successful in knowledge discovery. The SUBDUE substructure discovery system provides one such combination of approaches. This work presents SUBDUE and the develop...

متن کامل

Applying the Subdue Substructure Discovery System to the Chemical Toxicity Domain

The ever-increasing number of chemical compounds added every year has not been accompanied by a similar growth in our ability to analyze and classify these compounds. The problem of prevention of cancer caused by many of these chemicals has been of great scientific and humanitarian value. The use of AI discovery tools for predicting chemical toxicity is being investigated. The basic idea behind...

متن کامل

Substructure Discovery Using Minimum Description Length and Background Knowledge

The ability to identify interesting and repetitive substructures is an essential component to discovering knowledge in structural data. We describe a new version of our Subdue substructure discovery system based on the minimum description length principle. The Subdue system discovers substructures that compress the original data and represent structural concepts in the data. By replacing previo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992